Functional Logic Origami Programming with Open CFLP

نویسندگان

  • Tetsuo Ida
  • Mircea Marin
چکیده

Origami is a Japanese traditional art of paper folding. Recently, Origami became a topic of active research due to its relation to art, geometry, theorem proving, and declarative programming. It has been recognized that several interesting mathematical problems can be described in an elegant way by paper folds. In this paper we describe an origami programming methodology based on functional logic programming. We use two software components. The first one provides primitives to construct, manipulate and visualize paper folds. The second one, called Open CFLP, solves systems of equations whose operations are defined by conditional rewrite rules. We show that paper folding constructs can be expressed as systems of equations which are then solved by Open CFLP. Both components of our programming environment are implemented in Mathematica. We illustrate functional logic origami programming with some interesting examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collaborative Constraint Functional Logic Programming System in an Open Environment

In this paper we describe collaborative constraint functional logic programming and the system called Open CFLP that supports this programming paradigm. The system solves equations by collaboration of various equational constraint solvers. The solvers include higher-order lazy narrowing calculi that serve as the interpreter of higher-order functional logic programming, and specialized solvers f...

متن کامل

Real Constraints within a Functional Logic Language

We present a declarative language { CFLP(R) { which integrates lazy functional programming, logic programming and constraint solving over real numbers. Both a (higher order, polymorphic, lazy) functional language and (pure) CLP(R) can be isolated as subsets of our language. Through several examples we attempt to demonstrate the interest of CFLP(R). The execution mechanism of the language consis...

متن کامل

Constraint functional logic programming over finite domains

In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...

متن کامل

A new generic scheme for functional logic programming with constraints

In this paper we propose a new generic scheme CFLP(D), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given constraint domain D . As in the case of the well known CLP(D) scheme for Constraint Logic Programming, D is assumed to provide domain specific data values and constraints. CFLP(D) programs are presented as sets of constr...

متن کامل

Declarative Debugging of Missing Answers in Constraint Functional-Logic Programming

It is well known that constraint logic and functional-logic programming languages have many advantages, and there is a growing trend to develop and incorporate effective tools to this class of declarative languages. In particular, debugging tools are a practical need for diagnosing the causes of erroneous computations. Recently [1], we have presented a prototype tool for the declarative diagnos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003